Construction of Neural Network using Cluster Analysis and Voronoi Diagram.
نویسندگان
چکیده
منابع مشابه
Power Network Voronoi Diagram and Dynamic Construction
Objective Voronoi diagrams are important in many fields in a series of sciences. Network Voronoi diagrams are useful to investigate dominance regions in a grid street system or a radial-circular street system. However, all generators may have different effect. To deal with a network Voronoi diagram with varied functions of generators, it must be worth formulating a power network Voronoi diagram...
متن کاملscour modeling piles of kambuzia industrial city bridge using hec-ras and artificial neural network
today, scouring is one of the important topics in the river and coastal engineering so that the most destruction in the bridges is occurred due to this phenomenon. whereas the bridges are assumed as the most important connecting structures in the communications roads in the country and their importance is doubled while floodwater, thus exact design and maintenance thereof is very crucial. f...
Point Cluster Simplification Using Weighted Voronoi Diagram
This paper proposes an algorithm for simplifying point features on maps based on the multiplicatively weighted Voronoi diagram (MWVD). To ensure statistical, thematic, metric, and topological information contained in the original point features can be transmitted correctly after simplification, the algorithm selects corresponding measures to quantify these four types of information, and integra...
متن کاملSpatial Density Voronoi Diagram and Construction
To fill a theory gap of Voronoi diagrams that there have been no reports of extended diagrams in spatial density so far. A new concept of spatial density Voronoi diagram was proposed. An important property was presented and proven. And a construction algorithm was presented. Spatial density can be used to indicate factors related to density such as conveyance and the traffic conditions. Some pr...
متن کاملRobustness of k-gon Voronoi diagram construction
In this paper, we present a plane sweep algorithm for constructing the Voronoi diagram of a set of non-crossing line segments in 2D space using a distance metric induced by a regular k-gon and study the robustness of the algorithm. Following the algorithmic degree model [G. Liotta, F.P. Preparata, R. Tamassia, Robust proximity queries: an illustration of degree-driven algorithm design, SIAM J. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C
سال: 1999
ISSN: 0387-5024,1884-8354
DOI: 10.1299/kikaic.65.4048